Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes

Nonequivalent q-ary Perfect Codes

Prefixless q-ary Balanced Codes

We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information on the balancing index. Lookup tables for coding and decoding the prefix are avoided. Index Terms Constrained code, balanced code, running digital sum, Knuth code, error correction.

New 5 - ary and 7 - ary linear codes

Let [n, k, d]q code be a linear code of length n, dimension k and Hamming minimum distance d over GF(q). In this paper record-breaking codes with parameters [30, 10, 15]5, [33, 11, 16]5, [41, 10, 22]5, [24, 14, 8]7, [40, 11, 22]7, [60, 10, 38]7, [60, 13, 34]7, [88, 8, 63]7, [96, 11, 64]7, [96, 13, 61]7 and [96, 15, 58]7 are constructed.

Construction of new completely regular q-ary codes from perfect q-ary codes

In this paper from q-ary perfect codes a new completely regular q-ary codes are constructed. In particular two new ternary completely regular codes are obtained from the ternary Golay [11,6,5] code and new families of q-ary completely regular codes are obtained from q-ary 1-perfect codes.

New Constructions for q-ary Covering Codes

Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...